class Solution {
public:
    int massage(vector<int>& nums) {
        int n =nums.size();
        if(n==0)
            return 0;
        vector<int> f(n);
        vector<int> g(n);
        f[0] = nums[0];
        for(int i=1;i<n;i++)
        {
            f[i] = g[i-1]+nums[i];
            g[i] = max(f[i-1],g[i-1]);
        }
        return max(f[n-1],g[n-1]);
    }
};